Variational Low-Rank Matrix Factorization with Multi-Patch Collaborative Learning for Hyperspectral Imagery Mixed Denoising

نویسندگان

چکیده

In this study, multi-patch collaborative learning is introduced into variational low-rank matrix factorization to suppress mixed noise in hyperspectral images (HSIs). Firstly, based on the spatial consistency and nonlocal self-similarities, HSI partitioned overlapping patches with a full band. The similarity metric fusing features exploited select most similar construct corresponding patches. Secondly, considering that latent clean holds property across spectra, whereas component does not, proposed Bayesian framework for each patch. Using Gaussian distribution adaptively adjusted by gamma distribution, noise-free data can be learned exploring properties of spatial/spectral domain. Additionally, Dirichlet process mixture model utilized approximate statistical characteristics noises, which constructed exploiting inverse Wishart process. Finally, inference estimate all variables solve using closed-form equations. Widely used datasets different settings are adopted conduct experiments. quantitative qualitative results indicate effectiveness superiority method reducing noises HSIs.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multitask Sparse Nonnegative Matrix Factorization for Joint Spectral-Spatial Hyperspectral Imagery Denoising

Hyperspectral imagery (HSI) denoising is a challenging problem because of the difficulty in preserving both spectral and spatial structures simultaneously. In recent years, sparse coding, among many methods dedicated to the problem, has attracted much attention and showed state-of-the-art performance. Due to the low-rank property of natural images, an assumption can be made that the latent clea...

متن کامل

Low-rank matrix factorization with attributes

We develop a new collaborative filtering (CF) method that combines both previously known users’ preferences, i.e. standard CF, as well as product/user attributes, i.e. classical function approximation, to predict a given user’s interest in a particular product. Our method is a generalized low rank matrix completion problem, where we learn a function whose inputs are pairs of vectors – the stand...

متن کامل

Multi-View Spectral Clustering via Structured Low-Rank Matrix Factorization

Multi-view data clustering attracts more attention than their single view counterparts due to the fact that leveraging multiple independent and complementary information from multi-view feature spaces outperforms the single one. Multi-view Spectral Clustering aims at yielding the data partition agreement over their local manifold structures by seeking eigenvalue-eigenvector decompositions. Amon...

متن کامل

Learning Structured Low-Rank Representation via Matrix Factorization

A vast body of recent works in the literature have shown that exploring structures beyond data lowrankness can boost the performance of subspace clustering methods such as Low-Rank Representation (LRR). It has also been well recognized that the matrix factorization framework might offer more flexibility on pursuing underlying structures of the data. In this paper, we propose to learn structured...

متن کامل

COFI RANK - Maximum Margin Matrix Factorization for Collaborative Ranking

In this paper, we consider collaborative filtering as a ranking problem. We present a method which uses Maximum Margin Matrix Factorization and optimizes ranking instead of rating. We employ structured output prediction to optimize for specific non-uniform ranking scores. Experimental results show that our method gives very good ranking scores and scales well on collaborative filtering tasks.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Remote Sensing

سال: 2021

ISSN: ['2315-4632', '2315-4675']

DOI: https://doi.org/10.3390/rs13061101